Dynamic k-coverage planning for multiple events with mobile robots
نویسندگان
چکیده
منابع مشابه
Dynamic mission planning for multiple mobile robots
Planning for multiple mobile robots in dynamic environments involves determining the optimal path each robot should follow to accomplish the goals of the mission, given the current knowledge available about the world. As knowledge increases or improves, the planning system should dynamically reassign robots to goals in order to continually minimize the time to complete the mission. In this pape...
متن کاملCoverage Path Planning for Mobile Cleaning Robots
In this paper a path planning algorithms for a mobile cleaning robot is developed. An exact cellular decomposition divides an environment in multiple smaller regions called cells. To produce an efficient cleaning path, the order in which these cells are cleaned is important. This paper describes how the optimalization of this path can be formulated as a Traveling Salesman Problem. Furthermore a...
متن کاملMotion planning for multiple mobile robots using dynamic networks
A new motion planning framework is presented that enables multiple mobile robots with limited ranges of sensing and communication to maneuver and achieve goals safely in dynamic environments. To combine the respective advantages of centralized and de-centralized planning, this framework is based on the concept of centralized planning within dynamic robot networks. As the robots move in their en...
متن کاملComplete coverage path planning of mobile robots for humanitarian demining
The paper presents a path planning algorithm for a non-circular shaped mobile robot to autonomously navigate in an unknown area for humanitarian demining. For that purpose the path planning problem comes down to planning a path from some starting location to a final location in an area so that the robot covers all the reachable positions in the area while following the planned path. Based on ou...
متن کاملpolynomial optimal trajectory planning and obstacle aviodance for omni-directional mobile robots in dynamic environments
this paper presents a parameterization method to optimal trajectory planning and dynamic obstacle avoidance for omni-directional robots. the aim of trajectory planning is minimizing a quadratic cost function while a maximum limitation on velocity and acceleration of robot is considered. first, we parameterize the trajectory using polynomial functions with unknown coefficients which transforms t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Robotic Systems
سال: 2017
ISSN: 1729-8814,1729-8814
DOI: 10.1177/1729881417710792